Chinese Postman Problem

Research on Chinese Postman Problem Decision Process Algorithm

中国邮递员问题的动态规划算法研究

DNA Computing Model Based on a New Scheme of Encoding Weight for Chinese Postman Problem

基于一种新的边权编码方案的中国邮递员问题的DNA计算模型

In the paper , a solution method of the Chinese postman problem is given .

本文给出中国邮路问题的一个解法。

A Solution Method of the Chinese Postman Problem

中国邮路问题的一个解法

Therefore , time-dependent study of Chinese Postman problem becomes more urgent and significant .

所以时间依赖的中国邮路问题的研究越来越显得紧迫和意义重大。

Chinese Postman Problem is one of the classical problems in graph theory and has received much research .

中国邮路问题是图论中的经典问题之一，得到了广泛的研究。

A Survey on the Chinese Postman Problem

中国投递员问题综述

A Branch-and-Cut Algorithm for the Time-Dependent Undirected Chinese Postman Problem

时间依赖的无向中国邮路问题分支切割算法

First , the stochastic network model and the definition of undirected Chinese Postman Problem in stochastic networks are proposed in the paper .

本文首先给出了随机网络的模型和随机网络无向中国邮路问题的定义，在网络中引入随机因素，每条弧上的权值包含两个状态，网络中不同弧上的权值是相互依赖的随机变量。

Chinese postman problem is a classic graphic problem , it is widely applied by fields such as software tested , mail delivered .

中国邮路问题是图论经典问题之一，在软件测试、邮件投递等诸多领域中都被广泛应用。

Since the Chinese Postman Problem ( CPP ) was proposed , it has been studied in depth by many specialists and scholars .

中国邮路问题自从被提出以来，得到了许多专家学者的深入研究。

We study the Time-Dependent Chinese Postman Problem ( TDCPP ) and set up a new Integer Linear Program Model : Arc-Path Model .

本文针对时间依赖中国邮路问题展开研究，给出了时间依赖中国邮路问题的描述，建立了一个新的线性整数规划模型：弧-路径模型。

As a kind of classical problem in graph theory , the traditional Chinese Postman Problem and its variants which based on the static networks have been studied for decades .

作为一类经典的网络优化问题，传统中国邮路及其变体问题已经被很多学者广泛的研究，此时网络中权值为固定常量，属于静态网络范畴。

This paper puts forward a two-stage algorithm for the Time Dependent Rural Postman Problem with Time Windows ( TDRPPTW ), which is an important variant of the well-known Chinese Postman Problem .

本文研究了带时间窗的时间依赖乡村邮路问题（TDRPPTW），该问题是中国邮路问题（CPP）的变体之一。

Therefore , the research of new network model and associated high efficient algorithm for Chinese Postman Problem in stochastic networks become an important problem to be solved urgently , which is also the goal of this paper .

所以需要提出随机网络中国邮路问题的模型，并借鉴随机网络最短路径问题算法思想给出高效的算法。

Chinese Postman problem is the arc routing problem and a classic problem in graph theory . As a variant of Chinese Postman problem , rural postal routes problem has been studied extensively .

中国邮路问题是弧路由问题，是图论中的经典问题，作为中国邮路问题的变体，乡村邮路问题也得到了广泛的研究。

When the cost of traversing an edge depends upon the direction of a postman traversing , the Chinese postman problem will become the windy postman problem ( WPP ) .

当投递员穿过边的方向不同，费用就不同时，中国投递员问题就成为带风向的投递员问题（WPP）。

According to the relationship and traffic regulations between mobile stations and urban road system , a digraph model has been presented by this paper , which makes the issue of DT for mobile stations ' switch-links become Chinese postman problem .

根据基站与城市道路之间的关系以及交通规则，本文提出了移动基站切换链路测方法的有向图模型，使移动基站切换链路测问题成为了中国邮路问题。